Ratio Cut Hypergraph Partitioning Using Bdd Based Mboa Optimization Algorithm
نویسندگان
چکیده
This paper deals with the k-way ratio cut hypergraph partitioning utilizing the Mixed discrete continuous variant of the Bayesian Optimization Algorithm (mBOA). We have tested our algorithm on three partitioning taxonomies: recursive minimum ratio cut, multi-way minimum ratio cut and recursive minimum cut bisection. We have also derived a new approach for modeling of Boolean functions using binary decision diagrams (BDDs) which are primarily used as a probabilistic model of the mBOA algorithm.
منابع مشابه
Constrained Min-Cut Replication for K-Way Hypergraph Partitioning
R is a widely-used technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning are proposed for various problems arising in information retrieval and database systems. We consider the possibility of using vertex replication to improve the quality of hypergraph parti...
متن کاملK−way Hypergraph Partitioning and Color Image Segmentation
The goal of still color image segmentation is to divide the image into homogeneous regions. Object extraction, object recognition and object−based compression are typical applications that use still segmentation as a low−level image processing. In this paper, we present a method for color image segmentation. It formulates a color image segmentation problem as a partition of a Color Image Neighb...
متن کاملCombining Two Local Search Approaches to Hypergraph Partitioning
We study leading-edge local search heuristics for balanced hypergraph partitioning and Boolean satisfiability, intending the generalization of such heuristics beyond their original domains. We adapt the Fiduccia Mattheyses (FM) hypergraph partitioning heuristic to Boolean Satisfiability (SAT), and the WalkSAT SAT solver to hypergraph partitioning. Focusing on balanced hypergraph partitioning, w...
متن کاملWeighted Adaptive Neighborhood Hypergraph Partitioning for Image Segmentation
The aim of this paper is to present an improvement of a previously published algorithm. The proposed approach is performed in two steps. In the first step, we generate the Weighted Adaptive Neighborhood Hypergraph (WAINH) of the given gray-scale image. In the second step, we partition the WAINH using a multilevel hypergraph partitioning technique. To evaluate the algorithm performances, experim...
متن کاملA New Relaxation Approach to Normalized Hypergraph Cut
Normalized graph cut (NGC) has become a popular research topic due to its wide applications in a large variety of areas like machine learning and very large scale integration (VLSI) circuit design. Most of traditional NGC methods are based on pairwise relationships (similarities). However, in real-world applications relationships among the vertices (objects) may be more complex than pairwise, w...
متن کامل